Weak convergence and averaging for ODE
نویسندگان
چکیده
This mostly expository paper shows how weak convergence methods provide simple, elegant proofs of (i) the stabilization of an inverted pendulum under fast vertical oscillations, (ii) the existence of particle traps induced by rapidly varying electric fields and (iii) the adiabatic invariance of ∫ Γ p dx for slowing varying planar Hamiltonian dynamics. Under an appropriate, but very restrictive, unique ergodicity assumption, the proof of (iii) extends also to many degrees of freedom. For Juan Luis Vazquez on his 70th birthday.
منابع مشابه
THE USE OF A RUNGE-KUTTA SCHEME FOR AN ODE-PDE MODEL OF SUPPLY CHAINS
Integrating various suppliers to satisfy market demand is of great importance for e ective supply chain management. In this paper, we consider the ODE-PDE model of supply chain and apply a classical explicit fourth-order Runge-Kutta scheme for the related ODE model of suppliers. Also, the convergence of the proposed method is proved. Finally a numerical example is studied to demonstrate the acc...
متن کاملSelection of Intermodal Conductivity Averaging Scheme for Unsaturated Flow in Homogeneous Media
The nonlinear solvers in numerical solution of water flow in variably saturated soils are prone to convergence difficulties. Many aspects can give rise to such difficulties, like very dry initial conditions, a steep pressure gradient and great variation of hydraulic conductivity occur across the wetting front during the infiltration of water. So, the averaging method applied to compute hydraul...
متن کامل[hal-00782034, v1] Learning Equilibria in Games by Stochastic Distributed Algorithms
We consider a class of fully stochastic and fully distributed algorithms, that we prove to learn equilibria in games. Indeed, we consider a family of stochastic distributed dynamics that we prove to converge weakly (in the sense of weak convergence for probabilistic processes) towards their mean-field limit, i.e an ordinary differential equation (ODE) in the general case. We focus then on a cla...
متن کاملLearning Equilibria in Games by Stochastic Distributed Algorithms
We consider a class of fully stochastic and fully distributed algorithms, that we prove to learn equilibria in games. Indeed, we consider a family of stochastic distributed dynamics that we prove to converge weakly (in the sense of weak convergence for probabilistic processes) towards their mean-field limit, i.e an ordinary differential equation (ODE) in the general case. We focus then on a cla...
متن کاملStrong convergence results for fixed points of nearly weak uniformly L-Lipschitzian mappings of I-Dominated mappings
In this paper, we prove strong convergence results for a modified Mann iterative process for a new class of I- nearly weak uniformly L-Lipschitzian mappings in a real Banach space. The class of I-nearly weak uniformly L-Lipschitzian mappings is an interesting generalization of the class of nearly weak uniformly L-Lipschitzian mappings which inturn is a generalization of the class of nearly unif...
متن کامل